PRA*: Massively Parallel Heuristic Search
نویسندگان
چکیده
منابع مشابه
PRA*: Massively Parallel Heuristic Search
In this paper we describe a variant of A* search designed to run on the massively parallel, SIMD Connection Machine (CM-2). The algorithm is designed to run in a limited memory by use of a retraction technique which allows nodes with poor heuristic values to be removed from the open list, until such time as they may need reexpansion, more promising paths having failed. Our algorithm, called PRA...
متن کاملParallel Heuristic Search
SYNCHEM is a large expert system in the domain of organic chemistry. It finds synthetic pathways by chaining backwards from the target molecule to available compounds. SYNCHEM uses heuristic search to explore the solution space efficiently. Depending on the complexity of the target compound, the system currently takes from a few hours to several days.to solve an interesting problem using the pr...
متن کاملParallel Meta-Heuristic Search
We present a general picture of the parallel meta-heuristic search for optimization. We recall the main concepts and strategies in designing parallel metaheuristics, pointing to a number of contributions that instantiated them for neighborhoodand populationbased meta-heuristics, and identify trends and promising research directions. We focus on cooperation-based strategies, which display remark...
متن کاملParallel heuristic search in Haskell
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming languag...
متن کاملMassively Parallel A* Search on a GPU
A* search is a fundamental topic in artificial intelligence. Recently, the general purpose computation on graphics processing units (GPGPU) has been widely used to accelerate numerous computational tasks. In this paper, we propose the first parallel variant of the A* search algorithm such that the search process of an agent can be accelerated by a single GPU processor in a massively parallel fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1995
ISSN: 0743-7315
DOI: 10.1006/jpdc.1995.1036